Topologically Sweeping Visibility Complexes via
نویسندگان
چکیده
This paper describes a new algorithm for constructing the set of free bitangents of a collection of n disjoint convex obstacles of constant complexity. The algorithm runs in time O(n log n + k), where k is the output size, and uses O(n) space. While earlier algorithms achieve the same optimal running time, this is the first optimal algorithm that uses only linear space. The visibility graph or the visibility complex can be computed in the same time and space. The only complicated data structure used by the algorithm is a splittable queue, which can be implemented easily using red–black trees. The algorithm is conceptually very simple, and should therefore be easy to implement and quite fast in practice. The algorithm relies on greedy pseudotriangulations, which are subgraphs of the visibility graph with many nice combinatorial properties. These properties, and thus the correctness of the algorithm, are partially derived from properties of a certain partial order on the faces of the visibility complex.
منابع مشابه
Order Types and Visibility Types of Conngurations of Disjoint Convex Plane Sets Order Types and Visibility Types of Conngurations of Disjoint Convex Plane Sets Extended Abstract
We introduce the notions of order type (or: dual arrangement) and visibility type (or: tangent visibility graph) for conngurations of disjoint convex sets in the plane. We develop optimal algorithms for computing and sweeping the order type, and also give a worst case optimal algorithm for computing the tangent visibility graph. The methods are based on a relation, introduced in this paper, bet...
متن کاملSeeing Around Corners: Fast Orthogonal Connector Routing
Orthogonal connectors are used in drawings of many types of network diagrams, especially those representing electrical circuits. One approach for routing such connectors has been to compute an orthogonal visibility graph formed by intersecting vertical and horizontal lines projected from the corners of all obstacles and then use an A* search over this graph. However the search can be slow since...
متن کاملSimple Characterization of Polygons Searchable by 1-Searcher (Revised)
Suppose intruders are in a dark polygonal room and they can move arbitrarily fast, trying to avoid detection. A boundary 1-searcher can move along the polygon boundary, equipped with a flash light that she can direct in any direction. A polygon is searchable if there is a schedule for the searcher in order to detect the intruders no matter how they move. We identify three simple forbidden patte...
متن کاملVisibility sweeps for joint-hierarchical importance sampling of direct lighting for stochastic volume rendering
Physically-based light transport in heterogeneous volumetric data is computationally expensive because the rendering integral (particularly visibility) has to be stochastically solved. We present a visibility estimation method in concert with an importance-sampling technique for efficient and unbiased stochastic volume rendering. Our solution relies on a joint strategy, which involves the envir...
متن کامل